Generic skew-symmetric matrix polynomials with fixed rank and fixed odd grade
نویسندگان
چکیده
منابع مشابه
Perturbation Analysis for Complex Symmetric, Skew Symmetric, Even and Odd Matrix Polynomials
In this work we propose a general framework for the structured perturbation analysis of several classes of structured matrix polynomials in homogeneous form, including complex symmetric, skew-symmetric, even and odd matrix polynomials. We introduce structured backward errors for approximate eigenvalues and eigenvectors and we construct minimal structured perturbations such that an approximate e...
متن کاملFast and Robust Fixed-Rank Matrix Recovery
We address the problem of efficient sparse fixed-rank (SFR) matrix decomposition, i.e., splitting a corrupted matrix M into an uncorrupted matrix L of rank r and a sparse matrix of outliers S. Fixed-rank constraints are usually imposed by the physical restrictions of the system under study. Here we propose a method to perform accurate and very efficient S-FR decomposition that is more suitable ...
متن کاملFixed-rank matrix factorizations and Riemannian low-rank optimization
Motivated by the problem of learning a linear regression model whose parameter is a large fixed-rank non-symmetric matrix, we consider the optimization of a smooth cost function defined on the set of fixed-rank matrices. We adopt the geometric framework of optimization on Riemannian quotient manifolds. We study the underlying geometries of several well-known fixed-rank matrix factorizations and...
متن کاملSkew-Symmetric Matrix Polynomials and their Smith Forms
Two canonical forms for skew-symmetric matrix polynomials over arbitrary fields are characterized — the Smith form, and its skew-symmetric variant obtained via unimodular congruences. Applications include the analysis of the eigenvalue and elementary divisor structure of products of two skew-symmetric matrices, the derivation of a Smith-McMillan-like canonical form for skew-symmetric rational m...
متن کاملFixed Point and Bregman Iterative Methods for Matrix Rank Minimization
The linearly constrained matrix rank minimization problem is widely applicable in many fields such as control, signal processing and system identification. The tightest convex relaxation of this problem is the linearly constrained nuclear norm minimization. Although the latter can be cast as a semidefinite programming problem, such an approach is computationally expensive to solve when the matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2018
ISSN: 0024-3795
DOI: 10.1016/j.laa.2017.09.006